A class of Steiner 4-wise balanced designs derived from Preparata codes
نویسنده
چکیده
The minimum weight codewords in the Preparata code of length n = 4 m are utilized for the construction of an innnite family of Steiner S(4; f5; 6g; 4 m + 1) designs for any m 2. A t-wise balanced design with parameters t-(v; K;) is a pair (X; B) where X is a set of v points and B is a collection of subsets of X (called blocks) with sizes from the set K, such that every t-subset of X is contained in exactly blocks. If jKj=1, that is, all blocks are of the same size, say k, the design is a t-(v; k;) design. A Steiner design (or system) is a design with = 1. The notation S(t; K; v) (resp. S(t; k;)) is often used in this case. There has been recent interest in Steiner t-wise balanced designs, motivated by the lack of any known innnite family of Steiner systems S(t; k; v) for t 4 3]. In 3] Kramer and Mathon studied t-wise balanced Steiner designs on v 16 points and their extensions.
منابع مشابه
Constructions for generalized Steiner systems GS (3, 4, v , 2)
Generalized Steiner systems GS (3, 4, v, 2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance three, in which each codeword has length v and weight four. Not much is known for GS (3, 4, v, 2)s except for a recursive construction and two small designs for v = 8, 10 given by Etzion. In this paper, more s...
متن کاملOn the Preparata-like codes
A class of Preparata-like group codes is considered. It was suggested by Baker, van Lint and Wilson and re-stated in a different form by Ericson. We show that all such codes are inside the Hamming code providing its partition into the cosets of the Preparata-like codes. This partition induces 2-resolvable Steiner quadruple systems.
متن کاملt-Wise Balanced Designs
Steiner 3-wise balanced designs are constructed for parameters 3-(3n − 1, {4, 8}, 1), 3(qnm− qm, {q− 1, q, q+ 1}, 1), 3-(qnm− 2qm− 1, {qm− 3, qm− 2, qm− 1, qm, qm+ 1}, 1), 3-(qnm − 2qm, {qm − 3, qm − 2, qm − 1, qm, qm + 1}, 1), 3-(qnm − 2qm + 1, {qm − 3, qm − 2, qm−1, qm, qm+1}, 1), where q is a prime power and n ≥ 2, m ≥ 1 are integers. Further designs are obtained from these. © 2008 Elsevier ...
متن کاملOptimal constant weight codes over Zk and generalized designs
We consider optimal constant weight codes over arbitrary alphabets. Some of these codes are derived from good codes over the same alphabet, and some of these codes are derived from block design. Generalizations of Steiner systems play an important role in this context. We give several construction methods for these generalizations. An interesting class of codes are those which form generalized ...
متن کاملNew infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the support (size 5) of minimum Lee weight codewords form a simple 3-design for any odd integer m >t 3. We also show that the support of codewords with support size 6 form four new families of simple 3-designs, with parameters (2",6,2" 8 ) , (2",6,5 (2 m-I 4)), (2m,6,20 • (2...
متن کامل